Generating input data structures for automated program testing
نویسندگان
چکیده
منابع مشابه
Generating input data structures for automated program testing
Automatic test data generation usually concerns identifying input values that cause a selected path to execute. If a given path involves pointers, then input values may be represented in terms of 2-dimensional dynamic data structures such as lists or trees. When testing is conducted for programs in the presence of pointers, it is very important to identify a shape of the input data structure de...
متن کاملA Technique for Generating Graphical Abstractions of Program Data Structures
Representing abstract data structures in a real programming language is a key step of algorithm implementation and often requires programmers to introduce language-dependent details irrelevant for both a high-level analysis of the code and algorithm comprehension. In this paper we present a logic-based technique for recovering from the loss of abstraction related to the implementation process i...
متن کاملA method for automated program code testing
The Internet has recently encouraged the society to convert almost all its needs to electronic resources such as e-libraries, e-cultures, e-entertainment as well as e-learning, which has become a radical idea to increase the effectiveness of learning services in most schools, colleges and universities. E-learning can not be completely featured and met without e-testing. However, in many cases e...
متن کاملGenerating Input Documents for Testing XML Queries with ToXgene
Modern software technologies use the XML language as a preferred means of data interchange and representation, which can be accessed using XML queries. Testing these queries can be difficult because they use complex data as input in form of XML documents. This work addresses this problem by defining a query-aware procedure for design and generation of test input data for XML queries. The test p...
متن کاملGenerating irregular partitionable data structures
A fundamental problem in parallel computing is partitioning data structures in such a way as to minimize communication between processes while keeping the loads balanced. The problem is particularly acute when the underlying data structures are irregular, pointer-based structures. Here we present a methodology for partitioning a general class of dynamic data structures with guaranteed bounds on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software Testing, Verification and Reliability
سال: 2009
ISSN: 0960-0833,1099-1689
DOI: 10.1002/stvr.388